The Parallel Complexity of Elimination Ordering Procedures
نویسنده
چکیده
We prove that lexicographic breadthrst search is P-complete and that a variant of the parallel perfect elimination procedure of P. Klein [24] is powerful enough to compute a semi-perfect elimination ordering in sense of [23] if certain induced subgraphs are forbidden. We present an e cient parallel breadth rst search algorithm for all graphs which have no cycle of length greater four and no house as an induced subgraph. A side result is that a maximal clique can be computed in polylogarithmic time using a linear number of processors.
منابع مشابه
Angewandte Mathematik Und Informatik Universit at Zu K Oln Minimal Elimination of Planar Graphs
We prove that the problem to get an inclusion minimal elimination ordering can be solved in linear time for planar graphs. The basic structure of the linear time algorithm is as follows. We select a vertex r as maximum and get a rst approximation of a minimal elimination ordering considering a vertex x as smaller than y if x has a larger distance than y from r. Using planarity, one can determin...
متن کاملSymbolic Factorisation of Sparse Matrix Using Elimination Trees
Many problems in science and engineering require the solving of linear systems of equations. As the problems get larger it becomes increasingly important to exploit the sparsity inherent in many such linear systems. It is well recognized that finding a fill-reducing ordering is crucial to the success of the numerical solution of sparse linear systems. The use of hybrid ordering partitioner is e...
متن کاملTwo Strategies Based on Meta-Heuristic Algorithms for Parallel Row Ordering Problem (PROP)
Proper arrangement of facility layout is a key issue in management that influences efficiency and the profitability of the manufacturing systems. Parallel Row Ordering Problem (PROP) is a special case of facility layout problem and consists of looking for the best location of n facilities while similar facilities (facilities which has some characteristics in common) should be arranged in a row ...
متن کاملAn algorithm for computing an elimination tree of minimum height for a tree
The elimination tree is a rooted tree that is computed from the adjacency graph of a symmetric matrix A. The height of the elimination tree is one restricting factor when solving a sparse linear system Ax = b on a parallel computer using Cholesky factorization. An eecient algorithm is presented for the problem of ordering the nodes in a tree G so that its elimination tree is of minimum height. ...
متن کاملFrom a simple elimination ordering to a strong elimination ordering in linear time
We present a linear time algorithm for transforming a simple elimination ordering of a strongly chordal graph into a strong elimination ordering. 2003 Elsevier Science B.V. All rights reserved.
متن کامل